Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman Protocols

نویسنده

  • Berkant Ustaoglu
چکیده

Both the “eCK” model, by LaMacchia, Lauter and Mityagin, and the “CK01” model, byCanetti and Krawczyk, address the effect of leaking session specific ephemeral data on thesecurity of key establishment schemes. The CK01-adversary is given a SessionStateRevealquery to learn session specific private data defined by the protocol specification, whereasthe eCK-adversary is equipped with an EphemeralKeyReveal query to access all ephemeralprivate input required to carry session computations. SessionStateReveal cannot be issuedagainst the test session; by contrast EphemeralKeyReveal can be used against the test ses-sion under certain conditions. On the other hand, it is not obvious how EphemeralKeyRevealcompares to SessionStateReveal. Thus it is natural to ask which model is more useful andpractically relevant.While formally the models are not comparable, we show that recent analysis utilizingSessionStateReveal and EphemeralKeyReveal have a similar approach to ephemeral dataleakage. First we pinpoint the features that determine the approach. Then by examiningcommon motives for ephemeral data leakage we conclude that the approach is meaningful,but does not take into account timing, which turns out to be critical for security. Lastly,for Diffie-Hellman protocols we argue that it is important to consider security when discretelogarithm values of the outgoing ephemeral public keys are leaked and offer a method toachieve security even if the values are exposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffie-Hellman type key exchange protocols based on isogenies

‎In this paper‎, ‎we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves‎. ‎The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $‎, ‎is a straightforward generalization of elliptic curve Diffie-Hellman key exchange‎. ‎The method uses commutativity of the endomorphism ring $ End(E) $‎. ‎Then using dual isogenies‎, ‎we propose...

متن کامل

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem

Currently, there are a lot of authenticated key exchange (AKE) protocols in literature. However, the security proofs of this kind of protocols have been established to be a non-trivial task. The main issue is that without static private key it is difficult for simulator to fully support the SessionKeyReveal and EphemeralKeyReveal queries. Some proposals which have been proven secure either just...

متن کامل

A NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL

Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...

متن کامل

SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols

We present the SIGMA family of key-exchange protocols and the “SIGn-and-MAc” approach to authenticated Diffie-Hellman underlying its design. The SIGMA protocols provide perfect forward secrecy via a Diffie-Hellman exchange authenticated with digital signatures, and are specifically designed to ensure sound cryptographic key exchange while providing a variety of features and trade-offs required ...

متن کامل

Knapsack Diffie-Hellman: A New Family of Diffie-Hellman

Diffie-Hellman problems have been widely involved in the design of various cryptographic protocols. Its general family is based on the discrete logarithm over a finite field. Since 2000, its another family which is based on elliptic curve discrete logarithm as well as bilinear pairing, e.g. Weil or Tate pairing, has been attracted significant studies. Thereafter, various cryptographic protocols...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009